/**
*      author: Y_Yao
*      created: 2025-02-15 21:25:31
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 1.2e6 + 7;
int a[N];
int n,k;
int cnt[N];
int mu[N];
int ans[N];

void solve()
{
    cin >> n >> k;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        cnt[a[i]]++;
    }
    for(int i = 1;i < N;i++)
    {
        for(int j = i;j < N;j += i)
        {
            mu[i] += cnt[j];
        }
    }

    for(int d = 1;d < N;d++)
    {
        if(mu[d] < k) continue;
        for(int j = d;j < N;j += d)
        {
            ans[j] = max(ans[j],d);
        }
    }
    for(int i = 1;i <= n;i++)
    {
        cout << ans[a[i]] << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}